Term Selection for Filtering based on Distribution of Terms over Time
نویسندگان
چکیده
In this article we investigate the use of time distributions in retrieval tasks. Specifically, we introduce a novel term selection method, namely Term Occurrence Uniformity (TOU), based on the hypothesis that terms which occur uniformly in time are more valuable than others. Our empirical evaluation so far has neither proved nor disproved this hypothesis. However, results are promising and suggest the need for a deeper theoretical and empirical investigation. Our current concern is filtering, but this line of research may easily be extended to other retrieval tasks which involve temporally-dependent data.
منابع مشابه
Fast SFFS-Based Algorithm for Feature Selection in Biomedical Datasets
Biomedical datasets usually include a large number of features relative to the number of samples. However, some data dimensions may be less relevant or even irrelevant to the output class. Selection of an optimal subset of features is critical, not only to reduce the processing cost but also to improve the classification results. To this end, this paper presents a hybrid method of filter and wr...
متن کاملShort term electric load prediction based on deep neural network and wavelet transform and input selection
Electricity demand forecasting is one of the most important factors in the planning, design, and operation of competitive electrical systems. However, most of the load forecasting methods are not accurate. Therefore, in order to increase the accuracy of the short-term electrical load forecast, this paper proposes a hybrid method for predicting electric load based on a deep neural network with a...
متن کاملEffect of Rating Time for Cold Start Problem in Collaborative Filtering
Cold start is one of the main challenges in recommender systems. Solving sparsechallenge of cold start users is hard. More cold start users and items are new. Sine many general methods for recommender systems has over fittingon cold start users and items, so recommendation to new users and items is important and hard duty. In this work to overcome sparse problem, we present a new method for rec...
متن کاملOptimized computational Afin image algorithm using combination of update coefficients and wavelet packet conversion
Updating Optimal Coefficients and Selected Observations Affine Projection is an effective way to reduce the computational and power consumption of this algorithm in the application of adaptive filters. On the other hand, the calculation of this algorithm can be reduced by using subbands and applying the concept of filtering the Set-Membership in each subband. Considering these concepts, the fir...
متن کاملSampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کامل